The Bounded Tree-Width Problem of Context-Free Graph Languages
نویسنده
چکیده
We show that the following (equivalent) problems are P-complete: 1. Does a given connuent NCE graph grammar only generate graphs of bounded tree-width? and 2. is the graph language generated by a given connuent NCE graph grammar an HR language? This settles the complexity of these important problems on graph grammars .
منابع مشابه
Facial Circuits of Planar Graphs and Context-Free Languages
Abstrac t . It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf labels read from left to right. We give a generalization of this result in terms of planar graphs of bounded tree-width. Here the border of a planar graph is the word of edge labels of a path which borders...
متن کاملNCE Graph Grammars and Clique-Width
Graph grammars are widely used in order to deene classes of graphs having some inductive and narrow structure. In many cases the narrowness can be measured in terms of the maximal tree-width and/or clique-width of the graphs in the class, (see RS86],,CO00] for deenitions of these notions). It is known that using the corresponding tree-decomposition or clique-width parse term, any property of th...
متن کاملComputing LOGCFL certi#cates
The complexity class LOGCFL consists of all languages (or decision problems) which are logspace reducible to a context-free language. Since LOGCFL is included in AC, the problems in LOGCFL are highly parallelizable. By results of Ruzzo (JCSS 21 (1980) 218), the complexity class LOGCFL can be characterized as the class of languages accepted by alternating Turing machines (ATMs) which use logarit...
متن کاملUpper bounds to the clique width of graphs
A graph complexity measure that we call clique-width is associated in a natural way with certain graph decompositions, more or less like tree-width is associated with tree-decomposition which are, actually, hierarchical decompositions of graphs. In general, a decomposition of a graph G can be viewed as a nite term, written with appropriate operations on graphs, that evaluates to G. Innnitely ma...
متن کاملStructured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract)
The register allocation problem for an imperative program is often modelled as the coloring problem of the interference graph of the control-ow graph of the program. The interference graph of a ow graph G is the intersection graph of some connected subgraphs of G. These connected subgraphs represent the lives, or life times, of variables, so the coloring problem models that two variables with o...
متن کامل